A Simplification of the MV Matching Algorithm and its Proof
نویسنده
چکیده
For all practical purposes, the Micali-Vazirani [MV80] general graph maximum matching algorithm is still the most efficient known algorithm for the problem. The purpose of this paper is to provide a complete proof of correctness of the algorithm in the simplest possible terms; graph-theoretic machinery developed for this purpose also helps simplify the algorithm.
منابع مشابه
An Efficient Adaptive Boundary Matching Algorithm for Video Error Concealment
Sending compressed video data in error-prone environments (like the Internet and wireless networks) might cause data degradation. Error concealment techniques try to conceal the received data in the decoder side. In this paper, an adaptive boundary matching algorithm is presented for recovering the damaged motion vectors (MVs). This algorithm uses an outer boundary matching or directional tempo...
متن کاملA Proof of the MV Matching Algorithm
This paper gives the first complete proof of correctness of the Micali-Vazirani [MV80] general graph maximum cardinality matching algorithm. Our emphasis is on arriving at the simplest possible proof; graph-theoretic machinery developed for this purpose also helps simplify the description of this algorithm. For all practical purposes, this is still the most efficient known algorithm for the pro...
متن کاملالگوریتم انطباق مرزی ترکیبی و سریع برای اختفای خطای زمانی داده‌های ویدئویی
Despite data resilient methods against error that are applied on video data in transmitter side, occurringerror along video data transferring for communication channels is inevitable. Error concealment is a useful method for improving the quality of damaged videos in receiver side. In this paper, a fast and hybrid boundary matching algorithm is presented for more accurate estimating of damaged ...
متن کاملKinetic Mechanism Reduction Using Genetic Algorithms, Case Study on H2/O2 Reaction
For large and complex reacting systems, computational efficiency becomes a critical issue in process simulation, optimization and model-based control. Mechanism simplification is often a necessity to improve computational speed. We present a novel approach to simplification of reaction networks that formulates the model reduction problem as an optimization problem and solves it using geneti...
متن کاملA New RSTB Invariant Image Template Matching Based on Log-Spectrum and Modified ICA
Template matching is a widely used technique in many of image processing and machine vision applications. In this paper we propose a new as well as a fast and reliable template matching algorithm which is invariant to Rotation, Scale, Translation and Brightness (RSTB) changes. For this purpose, we adopt the idea of ring projection transform (RPT) of image. In the proposed algorithm, two novel s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012